Discrete mathematics - PDFSEARCH.IO - Document Search Engine

Discrete mathematics
Results: 2210

#	Item
591	Technical Report TTIC-TRMarch 2010 Dynamic Well-Spaced Point Sets Umut A. Acar Add to Reading List Source URL: www.ttic.edu Language: English - Date: 2012-09-18 12:01:28 NP-complete problems Delaunay triangulation Triangulation Voronoi diagram Discrete mathematics Mathematics Theoretical computer science Computational geometry
592	MAP DESPECKLING OF SAR IMAGES BASED ON LOCAL PDF MODELING IN THE UNDECIMATED WAVELET DOMAIN Fabrizio Argenti, Tiziano Bianchi, and Luciano Alparone Dipartimento di Elettronica e Telecomunicazioni, University of Florence Add to Reading List Source URL: ticsp.cs.tut.fi Language: English - Date: 2008-03-21 14:39:47 Wavelet Daubechies wavelet Discrete wavelet transform Orthogonal wavelet Stationary wavelet transform Biorthogonal wavelet Estimation theory Normal distribution Wavelet packet decomposition Mathematical analysis Wavelets Mathematics
593	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:07 NP-complete problems Clique problem Vertex cover Matching Eulerian path Clique Minimum spanning tree Randomized algorithm Connectivity Graph theory Theoretical computer science Mathematics
594	CS 70 Spring 2008 Discrete Mathematics for CS David Wagner Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:43 Integer factorization algorithms Euclidean algorithm Greatest common divisor Coprime Multiplicative inverse Modulo operation Recursion Extended Euclidean algorithm Modular multiplicative inverse Mathematics Number theory Modular arithmetic
595	Math. Appl), 153–167 DOI: maMATHEMATICAL EVOLUTION IN DISCRETE NETWORKS JOHN L. PFALTZ Abstract. This paper provides a mathematical explanation for the phenomenon of Add to Reading List Source URL: ma.fme.vutbr.cz Language: English - Date: 2014-01-27 06:31:16 Statistical dependence Matroid Topology Information theory Mutual information Mathematics Probability theory Independence
596	Discrete Applied Mathematics–49 Annealed replication: a new heuristic for the maximum clique problem Immanuel M. Bomzea; ∗ , Marco Budinichb , Marcello Pelilloc , Claudio Rossic Add to Reading List Source URL: www.dais.unive.it Language: English - Date: 2002-12-03 08:21:13 NP-complete problems Functional languages Procedural programming languages Recursion Clique problem Mathematical optimization Clique Independent set Dynamical system Theoretical computer science Mathematics Applied mathematics
597	C:UME~1jsaALS~1pd429f36_d443_4a75_bf9a_9b7f8bbaab4c.ps Add to Reading List Source URL: sp.cs.tut.fi Language: English - Date: 2008-08-06 09:38:00 Computational geometry Diagrams Discrete geometry Voronoi diagram Lattice Vector quantization Abstract algebra Geometry Mathematics
598	Formalization of Error-correcting Codes using SSReflect Reynald Affeldt1 and Jacques Garrigue1 1 National Institute of Advanced Industrial Science and Technology 2 Add to Reading List Source URL: www.math.nagoya-u.ac.jp Language: English - Date: 2014-11-13 21:13:13 Discrete mathematics Mathematics Linear code Low-density parity-check code Decoding methods Hamming code Hamming Forward error correction Parity-check matrix Coding theory Error detection and correction Information theory
599	CS 70 Spring 2005 Discrete Mathematics for CS Clancy/Wagner Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:43 Analysis of algorithms Arithmetic Computational complexity theory Binary GCD algorithm Big O notation Summation Time complexity Euclidean algorithm Greatest common divisor Mathematics Theoretical computer science Mathematical notation
600	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () Midterm Review SessionNote that these solutions are compact and only provide the key ideas in answer of the question. The Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:44:18 Network flow Hamiltonian path Maximum flow problem Ford–Fulkerson algorithm Flow network Tree decomposition Minimum spanning tree Graph theory Mathematics Theoretical computer science

UPDATE